An empirical study of datapath, memory hierarchy, and network in SIMD array architectures

Although SIMD arrays have been built for 30 years, they have as a class been the subject of few empirical design studies. Using ENPASSANT, a simulation environment developed for that purpose, we analyze several aspects of SIMD array architecture with respect to a test suite of spatially mapped applications. Several surprising results are obtained. With respect to memory hierarchy, we nd that adding a level of cache to current PE designs is likely to be advantageous , but that such a cache will look quite diierent than expected. In particular, we nd that associativity has unusual signiicance and that performance varies inversely with block size. Router network results indicate the importance of support for local transfers, broadcast, and reduction even at the expense of arbitrary permutations. Other communication results point to the appropriate dimensionality of k-ary n-cube networks (2 or 3), and the criticality of supporting bidi-rectional transfers, even if the overall bandwidth remains unchanged.